Recursive Computation of Steady-State Probabilities in Priority Queues
نویسندگان
چکیده
We derive recursive formulas for computing the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. We also discuss the applications of our method to other queueing systems.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملDiscrete-Time Analysis of MAP/PH/1 Multiclass General Preemptive Priority Queue
We use the matrix-geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady-state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981),...
متن کاملClassroom Note: Calculation of Steady-State Probabilities of M/M Queues: Further Approaches (Running title: Calculation of Steady-State Queues)
This paper draws attention to the risk of rounding error in the numerical evaluation of steady-state probabilities for the M/M family of queues. A method for avoiding the risk is presented which is easy to program for calculation in practice.
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملCalculation of steady-state probabilities of M/M queues: further approaches
This paper draws attention to the risk of rounding error in the numerical evaluation of steady-state probabilities for the M/M family of queues. A method for avoiding the risk is presented which is easy to program for calculation in practice.
متن کامل